A Method for Generating all the Prime Implicants of Binary CNF Formulas
نویسنده
چکیده
In this paper, we propose a method for generating all the prime implicants of a binary CNF formula. The main idea consists in using an algorithm for generating the maximal independent sets to compute all the primes implicants that cover a model. Such an approach mainly allows to reduce the number of calls to a SAT oracle. Before describing this algorithm, we propose a preprocessing method for reducing the search space, which is based on the use of the resolution closure. This method consists in exploiting the unit clauses and the equivalences generated in the resolution closure. Finally, we propose a simple approach for dividing the search space, which is based on the use of an algorithm that generates all the prime implicants that contain a
منابع مشابه
On the Combinatorics of SAT and the Complexity of Planar Problems
In this thesis we study several problems arising in Boolean satisfiability ranging from lower bounds for SAT algorithms and proof systems to extremal properties of formulas. The first problem is about construction of hard instances for k-SAT algorithms. For PPSZ algorithm [40] we give the first construction of k-CNF instances that require running time at least 2(1− k)n, where k = O(log2 k/k). F...
متن کاملAn Incremental Method for Generating Prime Implicants/Impicates
Given the recent investigation of Clause Management Systems (CMSs) for Artificial Intelligence applications, there is an urgent need for art efficient incremental method for generating prime implicants. Given a set of clauses 5 c, a set of prime implicants 1I of ~ and a clause C, the problem can be formulated as finding the set of prime implicaate for II t.J {C). Intuitively, the property of im...
متن کاملEnumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
In this paper, a new approach for enumerating the set prime implicants (PI) of a Boolean formula in conjunctive normal form (CNF) is proposed. It is based on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory. This first PI enumeration approach is then enhanced by an original use of the boolean functions or gates usually i...
متن کاملHeuristics for Thelen’s Prime Implicant Method
Thelen’s algorithm is an efficient method for generation of the prime implicants of a Boolean function represented in CNF. In the paper new heuristics are presented, allowing to accelerate the algorithm. Experimental analysis of their effects is performed.
متن کاملAnti-Links for Boolean Function Manipulation
Manipulation of Boolean functions has important applications in such fields as hardware verification, non-monotonic reasoning, and decision support. Most often, in such applications, the set of prime implicates/implicants of a large formula must be computed. Many algorithms have been proposed to compute the prime implicates of propositionalBoolean formulas, e.g. [4, 5]. Most of them assume that...
متن کامل